Minimum Equitable Dominating Partition Energy of a Graph
نویسندگان
چکیده
منابع مشابه
Graph Neural Network for Minimum Dominating Set
The dominating set concept in graphs has been used in many applications. In large graphs finding the minimum dominating set is difficult. The minimum dominating set problem in graphs seek a set D of minimum number of vertices such that each vertex of the graph is either in D or adjacent to a vertex in D. In a graph on n nodes if there is a single node of degree n-1 then that single node forms a...
متن کاملFinding a minimum independent dominating set in a permutation graph
We give an 0 (nlogln) [ime algorirnm for finding a minimum independem dominating se[ in a pennmation graph. TItis improves on ilie previous D(n 3) time algorictun known for solving tllis problem [4]. .,. Dept of CompUlcr Sci., Purdue Univ., West Gf:tyelle, IN 47907. Rcso::trch ~upported by ONR. Contr:lct NOOOI-l-34-K. 0502:md NSF Gl':tnl DCR-8451393, wilh matching funds from AT&T. • o.:pt of Ma...
متن کاملGraph Partition Problems with Minimum Size Constraints
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . x
متن کاملExact Algorithms for Dominating Induced Matching Based on Graph Partition
A dominating induced matching, also called an efficient edge domination, of a graph G = (V,E) with n = |V | vertices andm = |E| edges is a subset F ⊆ E of edges in the graph such that no two edges in F share a common endpoint and each edge in E\F is incident with exactly one edge in F . It is NP-hard to decide whether a graph admits a dominating induced matching or not. In this paper, we design...
متن کاملSome results on the energy of the minimum dominating distance signless Laplacian matrix assigned to graphs
Let G be a simple connected graph. The transmission of any vertex v of a graph G is defined as the sum of distances of a vertex v from all other vertices in a graph G. Then the distance signless Laplacian matrix of G is defined as D^{Q}(G)=D(G)+Tr(G), where D(G) denotes the distance matrix of graphs and Tr(G) is the diagonal matrix of vertex transmissions of G. For a given minimum dominating se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Informatics and Mathematical Sciences
سال: 2018
ISSN: 0974-875X,0975-5748
DOI: 10.26713/jims.v10i1-2.566